منابع مشابه
A Parallel Algorithm for Transitive Closure
We present a parallel algorithm for the problem of computing the transitive closure for an acyclic digraph D with n vertices and m edges. We use the BSP/CGM model of parallel computing. Our algorithm uses O(log p) rounds of communications with p processors, where p n, and each processor has O(mn p ) local memory. The local computation of each processor is equal to the product of the number of e...
متن کاملCoarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique
We investigate the relation between fine-grained and coarse-grained distributed computations of a class of problems related to the generic transitive closure problem (TC for short). We choose an intricate systolic algorithm for the TC problem, by Guibas, Kung and Thompson (GKT algorithm for short), as a starting point due to its particularly close relationship to matrix multiplication. The GKT ...
متن کاملData fragmentation for parallel transitive closure strategies
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In 10] the disconnection set approach has been introduced as an eeective strategy for such a computation. It involves reformulating a transitive closure query on a relation into a number of transitive closure queries on smaller fragments; these queries can then execute inde...
متن کاملA Single-Pass Algorithm for Transitive Closure
One of the most attractive methods for computing the transitive closure of a binary relation is to apply depth-rst search to the corresponding directed graph, recognize the strongly connected components, and, at the same time, compute the successor lists for all nodes. Recognizing the strongly connected components is important because the straightforward successor list computation computes corr...
متن کاملParallel Implementation of Italiano's Incremental Algorithm for Dynamic Updating the Transitive Closure
The transitive closure (or reachability) problem in a directed graph consists in finding whether there is a path between any two vertices. In this paper, we first study the problem of parallelization of Italiano's algorithm for dynamic updating the transitive closure after inserting a new arc into the graph represented as a list of arcs. To this end, by means of the data structure first propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Brazilian Computer Society
سال: 2012
ISSN: 0104-6500,1678-4804
DOI: 10.1007/s13173-012-0089-z